Heuristics for a continuous multi-facility location problem with demand regions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comparison of Four Multi-Objective Meta-Heuristics for a Capacitated Location-Routing Problem

In this paper, we study an integrated logistic system where the optimal location of depots and vehicles routing are considered simultaneously. This paper presents a new mathematical model for a multi-objective capacitated location-routing problem with a new set of objectives consisting of the summation of economic costs, summation of social risks and demand satisfaction score. A new multi-objec...

متن کامل

Dynamic Facility Location with Stochastic Demand

Determination of facilities, such as factories or warehouses, location and availability conditions is one of the important and strategic decisions for an organization to make. Transportation costs that form a major part of goods price are dependent to this decision making. There are verity of methods have been presented to achieve the optimal locations of these facilities which are generally de...

متن کامل

A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand

We develop an efficient allocation-based solution framework for a class of two-facility location– allocation problems with dense demand data. By formulating the problem as a multi-dimensional boundary value problem, we show that previous results for the discrete demand case can be extended to problems with highly dense demand data. Further, this approach can be generalized to non-convex allocat...

متن کامل

Local search heuristics for the mobile facility location problem

In the mobile facility location problem (MFLP), one seeks to relocate (or move) a set of existing facilities and assign clients to these facilities so that the sum of facility movement costs and the client travel costs (each to its assigned facility) is minimized. This paper studies formulations and develops local search heuristics for the MFLP. First, we develop an integer programming (IP) for...

متن کامل

Neighborhood search heuristics for the uncapacitated facility location problem

The uncapacitated facility location problem is one of choosing sites among a set of candidates in which facilities can be located, so that the demands of a given set of clients are satisfied at minimum costs. Applications of neighborhood search methods to this problem have not been reported in the literature. In this paper we first describe and compare several neighborhood structures used by lo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Operations Research

سال: 2015

ISSN: 0305-0548

DOI: 10.1016/j.cor.2014.09.001